Next Generation Multicuts for Semi-Planar Graphs
نویسنده
چکیده
We study the problem of multicut segmentation. We introduce modified versions of the Semi-PlanarCC based on bounding Lagrange multipliers. We apply our work to natural image segmentation.
منابع مشابه
Minimum multicuts and Steiner forests for Okamura-Seymour graphs
We study the problem of finding minimum multicuts for an undirected planar graph, where all the terminal vertices are on the boundary of the outer face. This is known as an Okamura-Seymour instance. We show that for such an instance, the minimum multicut problem can be reduced to the minimum-cost Steiner forest problem on a suitably defined dual graph. The minimum-cost Steiner forest problem ha...
متن کاملA simple algorithm for multicuts in planar graphs with outer terminals
Given an edge-weighted graph G and a list of source-sink pairs of terminal vertices of G, the minimum multicut problem consists in selecting a minimum weight set of edges of G whose removal leaves no path from the ith source to the ith sink, for each i. Few tractable special cases are known for this problem. In this paper, we give a simple polynomial-time algorithm solving it in undirected plan...
متن کاملA Polynomial-Time Algorithm for Planar Multicuts with Few Source-Sink Pairs
Given an edge-weighted undirected graph and a list of k source-sink pairs of vertices, the well-known minimum multicut problem consists in selecting a minimum-weight set of edges whose removal leaves no path between every source and its corresponding sink. We give the first polynomial-time algorithm to solve this problem in planar graphs, when k is fixed. Previously, this problem was known to r...
متن کاملEnergy Dissipation Rate Control Via a Semi-Analytical Pattern Generation Approach for Planar Three-Legged Galloping Robot based on the Property of Passive Dynamic Walking
In this paper an Energy Dissipation Rate Control (EDRC) method is introduced, which could provide stable walking or running gaits for legged robots. This method is realized by developing a semi-analytical pattern generation approach for a robot during each Single Support Phase (SSP). As yet, several control methods based on passive dynamic walking have been proposed by researchers to provide an...
متن کاملSegmenting Planar Superpixel Adjacency Graphs w.r.t. Non-planar Superpixel Affinity Graphs
We address the problem of segmenting an image into a previously unknown number of segments from the perspective of graph partitioning. Specifically, we consider minimum multicuts of superpixel affinity graphs in which all affinities between non-adjacent superpixels are negative. We propose a relaxation by Lagrangian decomposition and a constrained set of re-parameterizations for which we can op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1511.01994 شماره
صفحات -
تاریخ انتشار 2015